Universal photonic quantum computation via time-delayed feedback
نویسندگان
چکیده
منابع مشابه
Universal photonic quantum computation via time-delayed feedback.
We propose and analyze a deterministic protocol to generate two-dimensional photonic cluster states using a single quantum emitter via time-delayed quantum feedback. As a physical implementation, we consider a single atom or atom-like system coupled to a 1D waveguide with a distant mirror, where guided photons represent the qubits, while the mirror allows the implementation of feedback. We iden...
متن کاملTime-Delayed Quantum Feedback Control.
A theory of time-delayed coherent quantum feedback is developed. More specifically, we consider a quantum system coupled to a bosonic reservoir creating a unidirectional feedback loop. It is shown that the dynamics can be mapped onto a fictitious series of cascaded quantum systems, where the system is driven by past versions of itself. The derivation of this model relies on a tensor network rep...
متن کاملFinite Extinction Time via Delayed Feedback Actions
We study the “finite extinction phenomenon” for solutions of parabolic reaction-diffusion equations of the type ∂u ∂t −∆u+ b(t)f(u(t− τ,x)) = 0, (t,x) ∈ (0,+∞)×Ω, with a delay term τ > 0. Here Ω is an open and bounded set in R , b ≥ 0, f is a continuous function, u(t,x) satisfies a homogeneous Neumann or Dirichlet boundary condition on (0,+∞)×∂Ω and some functional initial condition u(s,x) = u0...
متن کاملQuantum cellular automaton for universal quantum computation
A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...
متن کاملUniversal computation by quantum walk.
In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2017
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1711003114